ILSB: Indexing with Least Significant Bit Algorithm for Effective Data Hiding

Data transmission is frequently face intrusions issues. Different data hiding methods are there to address this problem. Steganography being one; intends on writing hidden messages in such a way that no one, apart from the sender and intended recipient, suspects the existence of the message. Moreover, cryptography is a tool used in protecting information using cipher text. However, these methods are subjected to suspicion and prone to visual and statistical attacks. While trying to overcome such problems, researchers need to compromise with imperceptibility and hiding capacity. Any basic algorithms including traditional Least Significant Bit algorithm are simpler and faster processing although they are highly vulnerable to these visual and statistical attacks. Once the algorithm is known extracting the hidden information is fairly simple using steganalysis tools. Thus, these are having relatively low data hiding capacity, security compared to the algorithms with enhancements. These enhancements use complex mathematical functions with existing algorithms using cryptography as a method of improving security. The employing cryptography involves complex mathematical calculations requiring advanced processing capabilities leading to slow performance. As a result; it’s difficult to work in low